On almost (k-1)-degenerate (k+1)-chromatic graphs and hypergraphs
نویسنده
چکیده
Recall that a (hyper)graph is d-degenerate if every of its nonempty subgraphs has a vertex of degree at most d. Every d-degenerate (hyper)graph is (easily) (d + 1)colorable. A (hyper)graph is almost d-degenerate if it is not d-degenerate, but every its proper subgraph is d-degenerate. In particular, if G is almost (k − 1)-degenerate, then after deleting any edge it is k-colorable. For k ≥ 2, we study properties of almost (k − 1)-degenerate (hyper)graphs that are not k-colorable. By definition, each such (hyper)graph is (k + 1)-critical.
منابع مشابه
The chromatic number of almost stable Kneser hypergraphs
Let V (n, k, s) be the set of k-subsets S of [n] such that for all i, j ∈ S, we have |i−j| ≥ s We define almost s-stable Kneser hypergraph KG ( [n] k )∼ s-stab to be the r-uniform hypergraph whose vertex set is V (n, k, s) and whose edges are the r-uples of disjoint elements of V (n, k, s). With the help of a Zp-Tucker lemma, we prove that, for p prime and for any n ≥ kp, the chromatic number o...
متن کاملColor-Critical Graphs and Hypergraphs with Few Edges: A Survey
A hypergraph is color-critical if deleting any edge or vertex reduces the chromatic number; a color-critical hypergraph with chromatic number k is k-critical. Every k-chromatic hypergraph contains a k-critical hypergraph, so one can study chromatic number by studying the structure of k-critical (hyper)graphs. There is vast literature on k-critical graphs and hypergraphs. Many references can be ...
متن کاملThe locating-chromatic number for Halin graphs
Let G be a connected graph. Let f be a proper k -coloring of G and Π = (R_1, R_2, . . . , R_k) bean ordered partition of V (G) into color classes. For any vertex v of G, define the color code c_Π(v) of v with respect to Π to be a k -tuple (d(v, R_1), d(v, R_2), . . . , d(v, R_k)), where d(v, R_i) is the min{d(v, x)|x ∈ R_i}. If distinct vertices have distinct color codes, then we call f a locat...
متن کاملComplete Subgraphs of Chromatic Graphs and Hypergraphs
In this note we consider k-chromatic graphs with given colour k r-graphs have vertex sets u C i , and no r-tuple (i .e. edge o f 1 the r-graph) has two vertices in the same colour class C i .
متن کاملOn the Number of Edges in Colour-Critical Graphs and Hypergraphs
A (hyper)graph G is called k-critical if it has chromatic number k, but every proper sub(hyper)graph of it is (k− 1)-colourable. We prove that for sufficiently large k, every k-critical triangle-free graph on n vertices has at least (k−o(k))n edges. Furthermore, we show that every (k+1)-critical hypergraph on n vertices and without graph edges has at least (k−3/ 3 √ k)n edges. Both bounds diffe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Mathematics
دوره 313 شماره
صفحات -
تاریخ انتشار 2013